Search Ordering Heuristics for Restarts-Based Constraint Solving
نویسندگان
چکیده
Over the past decade impressive advances have been made in solving Constraint Satisfaction Problems by using of randomization and restarts. In this paper we propose a new class of variable and value ordering heuristics based on learning from nogoods without storing them. We show empirically that these heuristics dramatically improve the performance of restarts-based constraint solving.
منابع مشابه
Learning from Failure in Constraint Satisfaction Search
Much work has been done on learning from failure in search to boost solving of combinatorial problems, such as clause-learning in boolean satisfiability (SAT), nogood and explanation-based learning, and constraint weighting in constraint satisfaction problems (CSPs), etc. Many of the top solvers in SAT use clause learning to good effect. A similar approach (nogood learning) has not had as large...
متن کاملUsing nogoods information from restarts in domain-splitting search
The use of restart techniques associated with learning nogoods in solving Constraint Satisfaction Problems (CSPs) is starting to be considered of major importance for backtrack search algorithms. In a backtracking search algorithm, with domain-splitting branching, nogoods can be learned from the last branch of the search tree, immediately before the restart occurs. This type of nogoods, named d...
متن کاملA heuristic based on domain-splitting nogoods from restarts
Inspired by Boolean Satisfiability Problems (SAT), Constraint Satisfaction Problems (CSP) are starting to use restart techniques associated with learning nogoods widely. Recent developments show how to learn nogoods from restarts and that these nogoods are of major importance when solving a CSP. Using a backtracking search algorithm, with domain-splitting branching, nogoods are learned from the...
متن کاملCombining Ordering Heuristics and Bundling Techniques for Solving Finite Constraint Satisfaction Problems
We investigate techniques to enhance the performance of backtrack search procedure with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We consider ordering heuristics for variables and/or values and bundling techniques based on the computation of interchangeability. While the former methods allow us to traverse the search space more effecti...
متن کاملEvaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpose numerous heuristics have been proposed. Some of the best of such heuristics exploit information about failures gathered throughout search and recorded in the form of constraint weights, while others measure the impor...
متن کامل